Termination w.r.t. Q of the following Term Rewriting System could be proven:
Q restricted rewrite system:
The TRS R consists of the following rules:
p(a(x0), p(a(a(a(x1))), x2)) → p(a(x2), p(a(a(b(x0))), x2))
Q is empty.
↳ QTRS
↳ DependencyPairsProof
Q restricted rewrite system:
The TRS R consists of the following rules:
p(a(x0), p(a(a(a(x1))), x2)) → p(a(x2), p(a(a(b(x0))), x2))
Q is empty.
Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:
P(a(x0), p(a(a(a(x1))), x2)) → P(a(a(b(x0))), x2)
P(a(x0), p(a(a(a(x1))), x2)) → P(a(x2), p(a(a(b(x0))), x2))
The TRS R consists of the following rules:
p(a(x0), p(a(a(a(x1))), x2)) → p(a(x2), p(a(a(b(x0))), x2))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ QDPOrderProof
Q DP problem:
The TRS P consists of the following rules:
P(a(x0), p(a(a(a(x1))), x2)) → P(a(a(b(x0))), x2)
P(a(x0), p(a(a(a(x1))), x2)) → P(a(x2), p(a(a(b(x0))), x2))
The TRS R consists of the following rules:
p(a(x0), p(a(a(a(x1))), x2)) → p(a(x2), p(a(a(b(x0))), x2))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].
The following pairs can be oriented strictly and are deleted.
P(a(x0), p(a(a(a(x1))), x2)) → P(a(a(b(x0))), x2)
P(a(x0), p(a(a(a(x1))), x2)) → P(a(x2), p(a(a(b(x0))), x2))
The remaining pairs can at least be oriented weakly.
none
Used ordering: Combined order from the following AFS and order.
P(x1, x2) = P(x2)
a(x1) = a(x1)
p(x1, x2) = p(x1, x2)
b(x1) = b
Lexicographic path order with status [19].
Precedence:
P1 > a1 > b
p2 > a1 > b
Status:
b: multiset
a1: [1]
P1: [1]
p2: [2,1]
The following usable rules [14] were oriented:
p(a(x0), p(a(a(a(x1))), x2)) → p(a(x2), p(a(a(b(x0))), x2))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ PisEmptyProof
Q DP problem:
P is empty.
The TRS R consists of the following rules:
p(a(x0), p(a(a(a(x1))), x2)) → p(a(x2), p(a(a(b(x0))), x2))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.